Performance Analysis of LDPC Decoding Techniques

نویسندگان

چکیده

Low density parity checking codes (LDPC) are one of the most important issues in coding theory at present. LDPC-code a type linear-block LDPC-codes. Channel might be considered as finest conversant and potent components cellular communications systems, that was employed for transmitting errors corrections imposed by noise, fading interfering. LDPC-codes advanced gain, i.e., new area coding. performances similar to Shannon-limiting, this led usage decoding several applications digital like DVB-S2 WLAN802.1..This paper aims know what is LDPC,what its application introduce encoding algorithms gives rise linear time also show regular irregular LDPC performance different methods LDPC. I discuss detail algorithm: bit flipping algorithm, from hard decision .belief propagation sum product algorithm minimum examples soft .I expect least some students or researchers involved researching would find helpful.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Efficient Decoding Techniques for LDPC Codes

Efficient decoding techniques for LDPC codes are in demand, since these codes are included in many standards nowadays. Although the theoretical performance of LDPC codes is impressive, their practical implementation leads to problems like numerical inaccuracy, limited memory resources, etc. We investigate methods that are suited to reduce the decoding complexity while still keeping the loss in ...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Optimizing and decoding LDPC codes with graph-based techniques

OF THE DISSERTATION Optimizing and Decoding LDPC codes with Graph-Based Techniques

متن کامل

Error Performance of Decoding of LDPC over AWGN Channel

The design of future communication systems with high throughput demands will become a critical task, especially when sophisticated channel coding schemes have to be applied. Low-Density Parity-Check(LDPC) codes are among the most powerful forward error correcting codes, since they enable to get as close as a fraction of a dB from the Shannon limit. A simplified decoding algorithms for decoding ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International journal of recent technology and engineering

سال: 2021

ISSN: ['2277-3878']

DOI: https://doi.org/10.35940/ijrte.e5067.019521